Proficient Centriod Selection Process for K-Mean Bunching Algorithm in Data Mining

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Dynamic Algorithm Selection for Data Mining Classification

Recommending appropriate classification algorithm for given new dataset is very important and useful task but also is full of challenges. According to NO-FREE-LUNCH theorem, there is no best classifier for different classification problems. It is difficult to predict which learning algorithm will work best for what type of data and domain. In this paper, a method of recommending classification ...

متن کامل

A Mid – Point based k-mean Clustering Algorithm for Data mining

In k-means clustering algorithm, the number of centroids is equal to the number of the clusters in which data has to be partitioned which in turn is taken as an input parameter. The initial centroids in original k-means are chosen randomly from the given dataset and for the same dataset different clustering results are produced with different randomly chosen initial centroids. This paper presen...

متن کامل

Performance Analysis of High Performance k-Mean Data Mining Algorithm for Multicore Heterogeneous Compute Cluster

In this paper, we have study the performance of k-Mean data-mining algorithm (k-Mean),which is implemented on the heterogeneous compute cluster with the multi core programming. The multicore program is implemented with MPI and C for the parallel computing and utilizing the maximum compute power of the heterogeneous cluster. The heterogeneous cluster is established with the help of MPICH2. We ha...

متن کامل

Clustering of Data Using K-Mean Algorithm

Clustering is associate automatic learning technique geared toward grouping a collection of objects into subsets or clusters. The goal is to form clusters that are coherent internally, however well completely different from one another. In plain words, objects within the same cluster ought to be as similar as potential, whereas objects in one cluster ought to be as dissimilar as potential from ...

متن کامل

FUZZY GRAVITATIONAL SEARCH ALGORITHM AN APPROACH FOR DATA MINING

The concept of intelligently controlling the search process of gravitational search algorithm (GSA) is introduced to develop a novel data mining technique. The proposed method is called fuzzy GSA miner (FGSA-miner). At first a fuzzy controller is designed for adaptively controlling the gravitational coefficient and the number of effective objects, as two important parameters which play major ro...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Computer Applications

سال: 2018

ISSN: 0975-8887

DOI: 10.5120/ijca2018916582